Termination w.r.t. Q proof of /tmp/tmpWinSGu/LengthOfFiniteLists_nokinds

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A__U11(tt, L) → MARK(L)
MARK(zeros) → A__ZEROS
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
A__AND(tt, X) → MARK(X)
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__U11(tt, L) → A__LENGTH(mark(L))
A__ISNATILIST(V) → A__ISNATLIST(V)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNATILIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNat(X)) → A__ISNAT(X)
MARK(isNatList(X)) → A__ISNATLIST(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

A__U11(tt, L) → MARK(L)
MARK(zeros) → A__ZEROS
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
A__AND(tt, X) → MARK(X)
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__U11(tt, L) → A__LENGTH(mark(L))
A__ISNATILIST(V) → A__ISNATLIST(V)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNATILIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNat(X)) → A__ISNAT(X)
MARK(isNatList(X)) → A__ISNATLIST(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__U11(tt, L) → MARK(L)
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(length(X)) → A__LENGTH(mark(X))
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
A__AND(tt, X) → MARK(X)
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNATILIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNat(X)) → A__ISNAT(X)
A__U11(tt, L) → A__LENGTH(mark(L))
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATILIST(V) → A__ISNATLIST(V)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNATILIST(cons(V1, V2)) → A__ISNAT(V1)
A__ISNATILIST(V) → A__ISNATLIST(V)

The remaining pairs can at least be oriented weakly.

A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__U11(tt, L) → MARK(L)
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(length(X)) → A__LENGTH(mark(X))
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
A__AND(tt, X) → MARK(X)
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
MARK(isNat(X)) → A__ISNAT(X)
A__U11(tt, L) → A__LENGTH(mark(L))
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNatList(X)) → A__ISNATLIST(X)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 0
POL(a__zeros) = 0
POL(a__U11(x₁, x₂)) = (4)x_1 + (4)x_2
POL(mark(x₁)) = (4)x_1
POL(a__isNatIList(x₁)) = 1
POL(and(x₁, x₂)) = x_1 + (2)x_2
POL(A__ISNATLIST(x₁)) = 0
POL(A__AND(x₁, x₂)) = (2)x_2
POL(a__length(x₁)) = x_1
POL(tt) = 0
POL(isNatList(x₁)) = 0
POL(zeros) = 0
POL(isNatIList(x₁)) = 1/4
POL(a__isNat(x₁)) = 0
POL(s(x₁)) = x_1
POL(isNat(x₁)) = 0
POL(a__isNatList(x₁)) = 0
POL(nil) = 1/4
POL(A__LENGTH(x₁)) = (1/2)x_1
POL(A__U11(x₁, x₂)) = x_1 + (2)x_2
POL(a__and(x₁, x₂)) = x_1 + (4)x_2
POL(U11(x₁, x₂)) = (4)x_1 + (2)x_2
POL(0) = 0
POL(cons(x₁, x₂)) = (2)x_1 + (4)x_2
POL(MARK(x₁)) = (2)x_1
POL(A__ISNATILIST(x₁)) = 1/2
POL(length(x₁)) = x_1

The value of delta used in the strict ordering is 1/2.
The following usable rules [17] were oriented:

a__U11(tt, L) → s(a__length(mark(L)))
a__zeros → cons(0, zeros)
a__isNat(0) → tt
a__isNatList(nil) → tt
a__isNatIList(zeros) → tt
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
a__length(nil) → 0
a__isNatIList(V) → a__isNatList(V)
mark(isNat(X)) → a__isNat(X)
mark(and(X1, X2)) → a__and(mark(X1), X2)
a__isNat(s(V1)) → a__isNat(V1)
a__and(tt, X) → mark(X)
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(V1)) → a__isNatList(V1)
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
a__zeros → zeros
mark(nil) → nil
mark(s(X)) → s(mark(X))
mark(tt) → tt
a__isNat(X) → isNat(X)
a__and(X1, X2) → and(X1, X2)
a__length(X) → length(X)
a__U11(X1, X2) → U11(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__U11(tt, L) → MARK(L)
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(length(X)) → A__LENGTH(mark(X))
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
A__AND(tt, X) → MARK(X)
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__U11(tt, L) → A__LENGTH(mark(L))
MARK(isNat(X)) → A__ISNAT(X)
MARK(isNatList(X)) → A__ISNATLIST(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U11(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
MARK(length(X)) → MARK(X)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
A__ISNAT(length(V1)) → A__ISNATLIST(V1)

The remaining pairs can at least be oriented weakly.

A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__U11(tt, L) → MARK(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
A__AND(tt, X) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__U11(tt, L) → A__LENGTH(mark(L))
MARK(isNat(X)) → A__ISNAT(X)
MARK(isNatList(X)) → A__ISNATLIST(X)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = (1/2)x_1
POL(a__U11(x₁, x₂)) = 1/4 + x_1 + (4)x_2
POL(a__zeros) = 0
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = (1/4)x_1
POL(and(x₁, x₂)) = (4)x_1 + x_2
POL(A__ISNATLIST(x₁)) = x_1
POL(A__AND(x₁, x₂)) = (4)x_2
POL(a__length(x₁)) = 1/4 + (4)x_1
POL(tt) = 0
POL(isNatList(x₁)) = (1/4)x_1
POL(zeros) = 0
POL(isNatIList(x₁)) = (1/4)x_1
POL(a__isNat(x₁)) = (1/4)x_1
POL(s(x₁)) = x_1
POL(isNat(x₁)) = (1/4)x_1
POL(a__isNatList(x₁)) = (1/4)x_1
POL(nil) = 0
POL(A__LENGTH(x₁)) = (4)x_1
POL(A__U11(x₁, x₂)) = (1/2)x_1 + (4)x_2
POL(a__and(x₁, x₂)) = (4)x_1 + x_2
POL(U11(x₁, x₂)) = 1/4 + x_1 + (4)x_2
POL(0) = 0
POL(cons(x₁, x₂)) = (4)x_1 + (5/4)x_2
POL(MARK(x₁)) = (4)x_1
POL(A__ISNATILIST(x₁)) = x_1
POL(length(x₁)) = 1/4 + (4)x_1

The value of delta used in the strict ordering is 1/8.
The following usable rules [17] were oriented:

a__isNatList(nil) → tt
a__isNatIList(zeros) → tt
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
a__length(nil) → 0
a__isNatIList(V) → a__isNatList(V)
mark(isNat(X)) → a__isNat(X)
mark(and(X1, X2)) → a__and(mark(X1), X2)
a__isNat(s(V1)) → a__isNat(V1)
a__and(tt, X) → mark(X)
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(V1)) → a__isNatList(V1)
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
a__zeros → zeros
mark(nil) → nil
mark(s(X)) → s(mark(X))
mark(tt) → tt
a__isNat(X) → isNat(X)
a__and(X1, X2) → and(X1, X2)
a__length(X) → length(X)
a__U11(X1, X2) → U11(X1, X2)
a__U11(tt, L) → s(a__length(mark(L)))
a__isNatIList(X) → isNatIList(X)
a__zeros → cons(0, zeros)
a__isNatList(X) → isNatList(X)
a__isNat(0) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__U11(tt, L) → MARK(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__LENGTH(cons(N, L)) → A__AND(a__isNatList(L), isNat(N))
A__AND(tt, X) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
MARK(isNat(X)) → A__ISNAT(X)
A__U11(tt, L) → A__LENGTH(mark(L))
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
MARK(isNatList(X)) → A__ISNATLIST(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs with 5 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                        ↳ QDPOrderProof

                      ↳ QDP

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

A__ISNAT(s(V1)) → A__ISNAT(V1)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNAT(s(V1)) → A__ISNAT(V1)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = (4)x_1
POL(s(x₁)) = 1 + (4)x_1

The value of delta used in the strict ordering is 4.
The following usable rules [17] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

                      ↳ QDP

                      ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPOrderProof

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__AND(tt, X) → MARK(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATILIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatIList(V2))
MARK(cons(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(V1, V2)) → A__AND(a__isNat(V1), isNatList(V2))

The remaining pairs can at least be oriented weakly.

MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(isNatList(X)) → A__ISNATLIST(X)
A__AND(tt, X) → MARK(X)

Used ordering: Polynomial interpretation [25,35]:

POL(a__zeros) = 1
POL(a__and(x₁, x₂)) = 2 + (2)x_1 + (3)x_2
POL(a__U11(x₁, x₂)) = 4 + x_1 + x_2
POL(mark(x₁)) = 4 + x_1
POL(a__isNatIList(x₁)) = 3 + (4)x_1
POL(U11(x₁, x₂)) = 1 + (3)x_1 + (2)x_2
POL(and(x₁, x₂)) = 3 + (3)x_1 + (4)x_2
POL(0) = 2
POL(A__ISNATLIST(x₁)) = 1 + (2)x_1
POL(A__AND(x₁, x₂)) = 1 + (2)x_2
POL(cons(x₁, x₂)) = 3 + (4)x_1 + (4)x_2
POL(a__length(x₁)) = 0
POL(MARK(x₁)) = 1 + x_1
POL(tt) = 3
POL(A__ISNATILIST(x₁)) = 1 + (3)x_1
POL(isNatList(x₁)) = (2)x_1
POL(zeros) = 3
POL(isNatIList(x₁)) = (4)x_1
POL(a__isNat(x₁)) = 4
POL(s(x₁)) = 1 + (2)x_1
POL(isNat(x₁)) = 1 + x_1
POL(length(x₁)) = 4
POL(a__isNatList(x₁)) = (3)x_1
POL(nil) = 4

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                      ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(isNatList(X)) → A__ISNATLIST(X)
A__AND(tt, X) → MARK(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 3 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
A__U11(tt, L) → A__LENGTH(mark(L))

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__LENGTH(cons(N, L)) → A__U11(a__and(a__isNatList(L), isNat(N)), L)
A__U11(tt, L) → A__LENGTH(mark(L))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [25,35]:

POL(A__LENGTH(x₁)) = 2 + (2)x_1
POL(A__U11(x₁, x₂)) = 4 + (2)x_1 + (4)x_2
POL(a__zeros) = 4
POL(a__and(x₁, x₂)) = x_1 + (2)x_2
POL(a__U11(x₁, x₂)) = 4 + (2)x_1 + (4)x_2
POL(mark(x₁)) = 4 + (2)x_1
POL(a__isNatIList(x₁)) = 4 + x_1
POL(U11(x₁, x₂)) = 4 + (2)x_1 + (4)x_2
POL(and(x₁, x₂)) = x_1 + (5/4)x_2
POL(0) = 0
POL(cons(x₁, x₂)) = 4 + (2)x_1 + (3)x_2
POL(a__length(x₁)) = 4 + (2)x_1
POL(tt) = 4
POL(isNatList(x₁)) = x_1
POL(zeros) = 0
POL(isNatIList(x₁)) = (1/2)x_1
POL(a__isNat(x₁)) = 4 + (5/4)x_1
POL(s(x₁)) = x_1
POL(isNat(x₁)) = x_1
POL(length(x₁)) = 4 + (2)x_1
POL(a__isNatList(x₁)) = x_1
POL(nil) = 4

The value of delta used in the strict ordering is 2.
The following usable rules [17] were oriented:

a__isNatList(nil) → tt
a__isNatIList(zeros) → tt
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
a__length(nil) → 0
a__isNatIList(V) → a__isNatList(V)
mark(isNat(X)) → a__isNat(X)
mark(and(X1, X2)) → a__and(mark(X1), X2)
a__isNat(s(V1)) → a__isNat(V1)
a__and(tt, X) → mark(X)
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(V1)) → a__isNatList(V1)
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
a__zeros → zeros
mark(nil) → nil
mark(s(X)) → s(mark(X))
mark(tt) → tt
a__isNat(X) → isNat(X)
a__and(X1, X2) → and(X1, X2)
a__length(X) → length(X)
a__U11(X1, X2) → U11(X1, X2)
a__U11(tt, L) → s(a__length(mark(L)))
a__isNatIList(X) → isNatIList(X)
a__zeros → cons(0, zeros)
a__isNatList(X) → isNatList(X)
a__isNat(0) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt, L) → s(a__length(mark(L)))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(length(V1)) → a__isNatList(V1)
a__isNat(s(V1)) → a__isNat(V1)
a__isNatIList(V) → a__isNatList(V)
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__and(a__isNat(V1), isNatIList(V2))
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__and(a__isNat(V1), isNatList(V2))
a__length(nil) → 0
a__length(cons(N, L)) → a__U11(a__and(a__isNatList(L), isNat(N)), L)
mark(zeros) → a__zeros
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(length(X)) → a__length(mark(X))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNatIList(X)) → a__isNatIList(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X1, X2) → U11(X1, X2)
a__length(X) → length(X)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.